#include <iostream>
#include <fstream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <deque>
#include <ctime>
#include <cstdlib>

using namespace std;

#define sz(x) ((int)((x).size()))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const double EPS = 1e-9;
const double PI = acos(-1.0);

const int INF = (int)(1e9);

int n, t;
int b[25];
int dp[3601];

void solve() {
	scanf("%d%d", &n, &t);
	for (int i = 0; i < n; i++) {
		scanf("%d", &b[i]);
	}
	for (int i = 0; i < 3601; i++) {
		dp[i] = INF;
	}
	dp[0] = 0;
	sort(b, b + n);
	reverse(b, b + n);
	for (int it = 0; it < 100; it++) {
		for (int i = 0; i < n; i++) {
			if (b[i] > 0) {
				for (int j = 0; j <= 3600; j++) {
					if (dp[j] != INF) {
						dp[min(j + b[i], 3600)] = min(dp[min(j + b[i], 3600)], dp[j] + 1);
					}
				}
			} else if (b[i] < 0) {
				for (int j = 3600; j >= 0; --j) {
					if (dp[j] != INF) {
						dp[max(j + b[i], 0)] = min(dp[max(j + b[i], 0)], dp[j] + 1);
					}
				}
			}
		}
	}
	int bst = t;
	while (dp[bst] == INF) bst++;
	printf("%d %d\n", dp[bst], bst - t);
}

int main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	int T;
	scanf("%d", &T);
	while (T-- > 0) {
		solve();
	}

	return 0;
}
